binary constraint造句
例句与造句
- The following are the decomposition methods defined for binary constraint satisfaction problems.
- Chordality is enforced by adding new binary constraints.
- An example of a tractable constraint language is that of binary domains and binary constraints.
- A condition that extends the last one holds for non-binary constraint satisfaction problems.
- The new problem only contains binary constraints; their scopes form a directed acyclic graph.
- It's difficult to find binary constraint in a sentence. 用binary constraint造句挺难的
- As for arc consistency, this removal might have to consider a binary constraint more than once.
- In particular, chordality is enforced by adding some " fake " binary constraints to the problem.
- The assumption of regularity done only for binary constraints leads to the " standardized form ".
- The binary constraints are used to enforce equality of the old variables shared between the two new variables.
- The following are conditions on binary constraint satisfaction problems where enforcing local consistency is tractable and allows establishing satisfiability:
- Indeed, path consistency can be enforced by removing from a binary constraint all evaluations that cannot be extended to another variable.
- Arc and path consistency can be generalized to non-binary constraints using tuples of variables instead of a single one or a pair.
- A set of binary constraints that is arc consistent and has no empty domain can be inconsistent only if the network of constraints contains cycles.
- These are binary constraints satisfied by any pair of values, and are used only to add edges to the primal graph of the problem.
- The first case is that of a binary constraint problem with an ordering of the variables that makes the ordered graph of constraint having width 1.
更多例句: 下一页